|
|
Hardware Acceleration Using Functional Languages
Hodaňová, Andrea ; Kadlček, Filip (referee) ; Fučík, Otto (advisor)
The aim of this thesis is to research how the functional paradigm can be used for hardware acceleration with an emphasis on data-parallel tasks. The level of abstraction of the traditional hardware description languages, such as VHDL or Verilog, is becoming to low. High-level languages from the domains of software development and modeling, such as C/C++, SystemC or MATLAB, are experiencing a boom for hardware description on the algorithmic or behavioral level. Functional Languages are not so commonly used, but they outperform imperative languages in verification, the ability to capture inherent paralellism and the compactness of code. Data-parallel task are often accelerated on FPGAs, GPUs and multicore processors. In this thesis, we use a library for general-purpose GPU programs called Accelerate and extend it to produce VHDL. Accelerate is a domain-specific language embedded into Haskell with a backend for the NVIDIA CUDA platform. We use the language and its frontend, and create a new backend for high-level synthesis of circuits in VHDL.
|
|
|
System for Autonomous Data Collection from Weighting Sensors
Lučanský, Adam ; Strnadel, Josef (referee) ; Šimek, Václav (advisor)
Práca sa zaoberá automómnym zaznamenávaním váhy včelích úlov. Zbernicová jednotka (STM32F0) zbiera dáta z dvoch prevodníkov HX711 a posiela ich na CAN zbernicu. Jednotky na zbernici sú prepojené telefónnym káblom ktorým su aj napájané. Na jednom z koncov zbernice sa nachádza Raspberry Pi 3 s rozšírením o CAN. Nazbierané dáta su posielané pomocou integrovaného WiFi modemu na webserver. Systém je napájaný z batérie nabíjanej solárnym panelom s dostatočným výkonom na nepretržitú prevádzku. Dáta su prezentované užívateľovi vo forme grafu na webovom rozhrani. Electronické váženie úlov nahradzuje aktuálne osobné meranie mechanickou váhou. Systém bol odtestovaný a nainštalovaný lokálnemu včelárovi.
|
|
|
An Efficient Functional Library for Finite Automata
Říha, Jakub ; Hruška, Martin (referee) ; Lengál, Ondřej (advisor)
Finite automata are an important mathematical abstraction, and in formal verification, they are used for a concise representation of regular languages. Operations often used on finite automata in this setting are testing their universality and language inclusion. \mbox{A naive} approach to implement these operations leads to an explicit determinization of the automata, which can be costly and undesirable. There is, however, a more advanced method for performing those operations, called the Antichains algorithm, which avoids such an explicit determinization. This work shows how finite automata operations can be effectively implemented in Haskell and compares several approaches of their implementation. The obtained results are compared with VATA, an imperative implementation of a finite automata library.
|
|
|
A Haskell Platform for Creating Progressive Web Applications
Zárybnický, Jakub ; Havlena, Vojtěch (referee) ; Lengál, Ondřej (advisor)
Tato práce se snaží usnadnit vývoj webových aplikací psaných v programovacím jazyce Haskell vytvořením sady komponent, které zatím chybí v jeho ekosystému knihoven, se zaměřením na komponenty nutné pro tvorbu Progressive Web Applications, aplikace, které používají nové technologie jako např. Service Workers. Tato práce porovnává, které komponenty se očekávají od webových platforem a které jsou dostupné pro Haskell; popisuje implementaci tří komponent (knihovny pro routování, úložiště a Service Workery); a implementuje tři aplikace, které demonstrují použití těchto komponent.
|
|
| |
|
|
Path Planning in 3D Space
Krčmář, Radim ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
Following thesis presents basics of motion planning, focusing on sampling-based algorithms. System for collision of objects in arbitrary dimensional space is created using linear algebra. Basic options for visualizaton of three-dimensional data are described. Selected algoritms were implemented in haskell and used to pull hedgehog out of the cage (popular disentanglement puzzle in Czech Republic).
|
|
|
Functional Data Stuctures and Algorithms
Straka, Milan ; Dvořák, Zdeněk (advisor) ; Koucký, Michal (referee) ; Brodal, Gerth (referee)
Title: Functional Data Structures and Algorithms Author: Milan Straka Institute: Computer Science Institute of Charles University Supervisor of the doctoral thesis: doc. Mgr. Zdeněk Dvořák, Ph.D, Computer Science Institute of Charles University Abstract: Functional programming is a well established programming paradigm and is becoming increasingly popular, even in industrial and commercial appli- cations. Data structures used in functional languages are principally persistent, that is, they preserve previous versions of themselves when modified. The goal of this work is to broaden the theory of persistent data structures and devise efficient implementations of data structures to be used in functional languages. Arrays are without any question the most frequently used data structure. Despite being conceptually very simple, no persistent array with constant time access operation exists. We describe a simplified implementation of a fully per- sistent array with asymptotically optimal amortized complexity Θ(log log n) and especially a nearly optimal worst-case implementation. Additionally, we show how to effectively perform a garbage collection on a persistent array. The most efficient data structures are not necessarily based on asymptotically best structures. On that account, we also focus on data structure...
|
|
|
Maintainable type classes for Haskell
Farka, František ; Pudlák, Petr (advisor) ; Křen, Tomáš (referee)
In this thesis we address a long-term maintainability problem in Haskell type class system. In particular we study a possibility of backward-compatible changes in existing class hierarchies. In the first part of the thesis we give a brief overview of the language. The following part summarizes current proposed solutions to the problem and analyzes their properties. Based on this analysis we derive our own language extension proposal. In the penultimate chapter we present several possible applications of the language extension and compare the extension to other solutions. As a part of the thesis we also give a proof-of-concept implementation of the extension for the GHC compiler, which is briefly described in the last part of this thesis. Powered by TCPDF (www.tcpdf.org)
|
|
|
Functional reactive programming for web applications
Smrž, Roman ; Pudlák, Petr (advisor) ; Hric, Jan (referee)
Functional reactive programming provides mechanisms of describing dynamic systems in a declarative and type-safe manner, which is traditional domain of functional languages in general and Haskell, which we use here, in particular. We explore ways, in which it may be applied to programming web applications, specifically, we design a domain specific language intended for writing web pages as a part of a Haskell program, which would generate the actual code served to the client, and enriching them with dynamic content; and also find out to what extent we may broaden the expressive power of such library given certain inherent constraints of the chosen method. In doing so, we utilize the tree-like structure of the HTML page, which is quite suitable to be written as a source code in a programming language and to which we embed additional entities providing the dynamics and interactivity.
|
|
|
A Haskell Platform for Creating Progressive Web Applications
Zárybnický, Jakub ; Havlena, Vojtěch (referee) ; Lengál, Ondřej (advisor)
Tato práce se snaží usnadnit vývoj webových aplikací psaných v programovacím jazyce Haskell vytvořením sady komponent, které zatím chybí v jeho ekosystému knihoven, se zaměřením na komponenty nutné pro tvorbu Progressive Web Applications, aplikace, které používají nové technologie jako např. Service Workers. Tato práce porovnává, které komponenty se očekávají od webových platforem a které jsou dostupné pro Haskell; popisuje implementaci tří komponent (knihovny pro routování, úložiště a Service Workery); a implementuje tři aplikace, které demonstrují použití těchto komponent.
|
guest ::
